A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand

We develop an efficient allocation-based solution framework for a class of two-facility location– allocation problems with dense demand data. By formulating the problem as a multi-dimensional boundary value problem, we show that previous results for the discrete demand case can be extended to problems with highly dense demand data. Further, this approach can be generalized to non-convex allocation decisions. This formulation is illustrated for the Euclidean metric case by representing the affine bisector with two points. A specialized multi-dimensional shooting algorithm is presented and illustrated on an example. Comparisons with two alternative methods through a computational study confirm the efficiency of the proposed methodology. & 2010 Elsevier Ltd. All rights reserved.